/**************************************************************************
***    
*** Copyright (c) 1995-2000 Regents of the University of California,
***               Andrew E. Caldwell, Andrew B. Kahng and Igor L. Markov
*** Copyright (c) 2000-2002 Regents of the University of Michigan,
***               Saurabh N. Adya and Igor L. Markov
***
***  Contact author(s): abk@cs.ucsd.edu, imarkov@umich.edu
***  Original Affiliation:   UCLA, Computer Science Department,
***                          Los Angeles, CA 90095-1596 USA
***
***  Permission is hereby granted, free of charge, to any person obtaining 
***  a copy of this software and associated documentation files (the
***  "Software"), to deal in the Software without restriction, including
***  without limitation 
***  the rights to use, copy, modify, merge, publish, distribute, sublicense, 
***  and/or sell copies of the Software, and to permit persons to whom the 
***  Software is furnished to do so, subject to the following conditions:
***
***  The above copyright notice and this permission notice shall be included
***  in all copies or substantial portions of the Software.
***
*** THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 
*** EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
*** OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. 
*** IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
*** CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT
*** OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR
*** THE USE OR OTHER DEALINGS IN THE SOFTWARE.
***
***
***************************************************************************/







//created on 06/27/98 by Andrew Caldwell (caldwell@cs.ucla.edu)

#ifndef _CLUSTHGRAPH_GREEDY_HEM_CLUSTERTREE_H_
#define _CLUSTHGRAPH_GREEDY_HEM_CLUSTERTREE_H_

#include "clustHGTreeBase.h"

class ClHG_Cluster;

struct HEMMatchRecord
{
    ClHG_Cluster* cl1;
    ClHG_Cluster* cl2;
    double   matchWeight;

    HEMMatchRecord(ClHG_Cluster* c1, ClHG_Cluster* c2, double wt)
        : cl1(c1), cl2(c2), matchWeight(wt)
        {}
    HEMMatchRecord()
        : cl1(NULL), cl2(NULL), matchWeight(DBL_MAX)
        {}
};

inline bool operator<(const HEMMatchRecord& m1, const HEMMatchRecord& m2)
        { return m1.matchWeight > m2.matchWeight; }



class GreedyHEMClusteredHGraph: public virtual ClHG_ClusterTreeBase
{
    vector<double> 		_edgeWeights;
    vector<ClHG_Cluster*>	_adjNodes;
    vector<ClHG_Cluster*>	_equalWtSmallNeighbors;
    vector<unsigned>		_randMap;

    vector<HEMMatchRecord>      _matchRecs;

  public:

    GreedyHEMClusteredHGraph(	const HGraphFixed &graph, 
			const Parameters  &params,
			const Partitioning* fixed = NULL,
			const Partitioning* curPart = NULL)
	: ClHG_ClusterTreeBase(graph, params, fixed, curPart)
	{}

    virtual ~GreedyHEMClusteredHGraph() {}


  protected:

    void populateTree();
    void heavyEdgeMatchingLevel(double maxChildArea, double maxNewArea,
				unsigned targetNum);

    void matchDegree2Nodes(double maxChildArea, double maxNewArea);
};

#endif

